Darbar · Trees 33 slots in the Leetcode Darbar catalog. Darbar Slot Problem Subtopic Difficulty 489 Binary Tree Paths backtracking easy 490 Merge Two Binary Trees bfs based easy 491 Maximum Depth Of Binary Tree bfs based easy 492 Invert Binary Tree bfs based easy 493 Univalued Binary Tree bfs based easy 494 Average Of Levels In Binary Tree bfs based easy 495 Range Sum Of Bst binary search tree easy 496 Search In A Binary Search Tree binary search tree easy 497 Binary Tree Inorder Traversal binary search tree easy 498 Convert Sorted Array To Binary Search Tree binary search tree easy 499 Binary Search Tree To Greater Sum Tree binary search tree medium 500 Root Equals Sum Of Children binary tree easy 501 Increasing Order Search Tree binary tree easy 502 Binary Tree Postorder Traversal binary tree easy 503 Binary Tree Preorder Traversal binary tree easy 504 Binary Tree Tilt binary tree easy 505 Range Sum Of Bst dfs based easy 506 Increasing Order Search Tree dfs based easy 507 Merge Two Binary Trees dfs based easy 508 Sum Of Root To Leaf Binary Numbers dfs based easy 509 Maximum Depth Of Binary Tree dfs based easy 510 Maximum Binary Tree divide and conquer medium 511 Convert Sorted Array To Binary Search Tree divide and conquer easy 512 Balance A Binary Search Tree divide and conquer medium 513 Count Subtrees With Max Distance Between Cities dp based hard 514 Sum Of Distances In Tree dp based hard 515 Binary Tree Cameras dp based hard 516 Maximum Sum Bst In Binary Tree dp based hard 517 Binary Tree Maximum Path Sum dp based hard 518 N Ary Tree Preorder Traversal n-ary tree easy 519 N Ary Tree Postorder Traversal n-ary tree easy 520 Maximum Depth Of N Ary Tree n-ary tree easy 521 Subtree Of Another Tree string matching easy All topics · Syllabus