AniketTheProgrammer
Home
(current)
Courses
Projects
YT Projects
Coding Questions
Notification
Contact Us
Log In
All Topics
C Language
C++ Language
Greedy Algorithm
Hashing
Java Language
Linked List
Python
Queue
Stack
String
Sorting
Searching
Recursion
Backtracking
Dynamic Programming
Graph Theory
Bit Manipulation
Mathematics
Sliding Window Technique
Divide And Conquer
Matrix Manipulation
Two Pointers
Binary Tree
Topic: Binary-tree-question / Level: Beginner
1. Implement a binary tree and display its structure.
2. Write a program to insert a node in a binary search tree (BST).
3. Write a function to find the height of a binary tree.
4. Create a function to count the number of nodes in a binary tree.
5. Implement a function to perform in-order traversal of a binary tree.
6. Implement a function to perform pre-order traversal of a binary tree.
7. Implement a function to perform post-order traversal of a binary tree.
8. Write a program to find the maximum value in a binary tree.
9. Write a program to find the minimum value in a binary tree.
10. Check if a binary tree is balanced.
11. Write a program to check if two binary trees are identical.
12. Create a function to convert a sorted array into a balanced binary search tree.
13. Write a function to check if a binary tree is a binary search tree.
14. Find the lowest common ancestor of two nodes in a binary tree.
15. Write a program to calculate the diameter of a binary tree.
16. Implement level-order traversal of a binary tree.
17. Write a function to find all leaf nodes in a binary tree.
18. Create a function to print all root-to-leaf paths in a binary tree.
19. Write a program to mirror a binary tree.
20. Implement a function to sum all the values of the nodes in a binary tree.
21. Create a function to find the kth smallest element in a BST.
22. Write a program to find the kth largest element in a BST.
23. Write a function to delete a node from a BST.
24. Create a program to print the ancestors of a given node in a binary tree.
25. Write a function to serialize and deserialize a binary tree.
26. Find the number of leaf nodes in a binary tree.
27. Write a program to find the maximum depth of a binary tree.
28. Check if a binary tree is symmetric.
29. Write a program to count the number of full nodes in a binary tree.
30. Create a function to print all nodes at a given depth in a binary tree.
Previous
1
2
3
4
5
6
7
Next
More Levels
Intermediate
Advanced
Most Visited
Implement a binary tree and display its structure.
Write a program to find the minimum sum of a path from root to leaf in a binary search tree with specific properties.
Write a program to find the total number of nodes in a binary search tree that are greater than a specific value and have specific properties and values.
Write a program to find the minimum sum of a path from root to leaf in a binary search tree with specific properties and values.
Write a program to find all the leaf-to-leaf paths in a binary tree with specific properties.
Implement a function to find all nodes at a given depth in a binary tree with specific properties.
Implement a function to check if a binary search tree has any nodes with even values and properties.
Write a program to check if a binary search tree is height-balanced with specific properties and values.
Write a program to find all nodes in a binary search tree that are leaves with specific properties and values.
Write a program to check if a binary search tree has any nodes with odd values and specific properties.
Write a program to check if a binary search tree is height-balanced with specific properties.
Write a program to find the total number of nodes in a binary tree that have even values and specific properties.
Write a program to find all nodes that are internal nodes in a binary search tree with specific properties.
Write a program to find the average value of nodes at each level in a binary search tree with specific properties.
Write a program to check if a binary search tree has any nodes with odd values and properties.