InterviewBit-Topicwise-Solutions/Trees at master · codeAligned/InterviewBit-Topicwise-Solutions

History

Name		Name	Last commit message	Last commit date
parent directory ..
2-SumBinaryTree.cpp		2-SumBinaryTree.cpp
BST nodes in a range.cpp		BST nodes in a range.cpp
BSTIterator.cpp		BSTIterator.cpp
BalancedBinaryTree.cpp		BalancedBinaryTree.cpp
Binary Tree Paths.cpp		Binary Tree Paths.cpp
BinaryTreeFromInorderAndPostorder.cpp		BinaryTreeFromInorderAndPostorder.cpp
Boundary Traversal Of Binary Tree.cpp		Boundary Traversal Of Binary Tree.cpp
Check for BST with exactly one child of each internal nodes.cpp		Check for BST with exactly one child of each internal nodes.cpp
Check if given Preorder, Inorder and Postorder traversals are of same tree.cpp		Check if given Preorder, Inorder and Postorder traversals are of same tree.cpp
Common Nodes in Two Binary Search Trees.cpp		Common Nodes in Two Binary Search Trees.cpp
ConstructBinaryTreeFromInorderAndPreorder.cpp		ConstructBinaryTreeFromInorderAndPreorder.cpp
Convert an arbitrary Binary Tree to a tree that holds Children Sum Property.cpp		Convert an arbitrary Binary Tree to a tree that holds Children Sum Property.cpp
Difference between odd and even levels.cpp		Difference between odd and even levels.cpp
Duplicates in binary tree.cpp		Duplicates in binary tree.cpp
Equal Tree Partition.cpp		Equal Tree Partition.cpp
FlattenBinaryTreeToLinkedList.cpp		FlattenBinaryTreeToLinkedList.cpp
HotelReviews.cpp		HotelReviews.cpp
IdenticalBinaryTree.cpp		IdenticalBinaryTree.cpp
InOrderTraversalOfCartesianTree.cpp		InOrderTraversalOfCartesianTree.cpp
InorderTraversal.cpp		InorderTraversal.cpp
InvertTheBinaryTree.cpp		InvertTheBinaryTree.cpp
KthSmallestElementInTree.cpp		KthSmallestElementInTree.cpp
Largest BST Subtree.cpp		Largest BST Subtree.cpp
LeastCommonAncestor.cpp		LeastCommonAncestor.cpp
Left view of binary tree.cpp		Left view of binary tree.cpp
Longest Consecutive Sequence in Binary Tree.cpp		Longest Consecutive Sequence in Binary Tree.cpp
Longest path in a subtree.cpp		Longest path in a subtree.cpp
MaxDepthOfABinaryTree.cpp		MaxDepthOfABinaryTree.cpp
Merge Two BSTs.cpp		Merge Two BSTs.cpp
MinimumDepthOfABinaryTree.cpp		MinimumDepthOfABinaryTree.cpp
NextGreaterNumberBST.cpp		NextGreaterNumberBST.cpp
Node distance C in binary tree.cpp		Node distance C in binary tree.cpp
OrderOfPeopleHeights.cpp		OrderOfPeopleHeights.cpp
PathSum.cpp		PathSum.cpp
PopulateNextRightPointersTree.cpp		PopulateNextRightPointersTree.cpp
PostOrderTraversal.cpp		PostOrderTraversal.cpp
PreOrderTraversal.cpp		PreOrderTraversal.cpp
Print all root to leaf paths.cpp		Print all root to leaf paths.cpp
RecoverBinarySearchTree.cpp		RecoverBinarySearchTree.cpp
Remove nodes from Path sum less than B.cpp		Remove nodes from Path sum less than B.cpp
RootToLeafPathsWithSum.cpp		RootToLeafPathsWithSum.cpp
ShortestUniquePrefix.cpp		ShortestUniquePrefix.cpp
Smallest Subtree with all the Deepest Nodes.cpp		Smallest Subtree with all the Deepest Nodes.cpp
SortedArrayToBalancedBST.cpp		SortedArrayToBalancedBST.cpp
Steps to get out of complete binary tree.cpp		Steps to get out of complete binary tree.cpp
Subarrays Xor less Than B.cpp		Subarrays Xor less Than B.cpp
Sum binary tree or not.cpp		Sum binary tree or not.cpp
SumRootToLeafNumbers.cpp		SumRootToLeafNumbers.cpp
SymmetricBinaryTree.cpp		SymmetricBinaryTree.cpp
ValidBinarySearchTree.cpp		ValidBinarySearchTree.cpp
VerticalOrderTraversalOfBinaryTree.cpp		VerticalOrderTraversalOfBinaryTree.cpp
ZigZagLevelOrderTraversalBT.cpp		ZigZagLevelOrderTraversalBT.cpp

Navigation Menu

Uh oh!

Uh oh!

FilesExpand file tree

Trees

Directory actions

More options

Directory actions

More options

Latest commit

History

Trees

Folders and files

parent directory