[Problems] Problems on Trees and Graphs for Interviews and Self Assessment

I will list down some problems on the topic of trees and graphs that are commonly asked in interviews. Please revise topics on tress such as Binary Trees, Binary Search Tree (BST), Balancing a Tree, Full and Complete Trees, Binary Tree Traversals (recursive), Tries, Depth First Search (DFS), Breadth First Search (BFS).

 

Problems

Trees

  1. Check if a binary tree is a Binary Search Tree (BST)

  2. Check if a given binary tree is balanced.

  3. Create a binary search tree with minimal height from a sorted increasing order array.

  4. Find difference between sum of nodes at odd levels and sum of nodes at even levels of a binary tree.

  5.  Given a Binary Search Tree (BST), create a linked list of nodes for every level.

  6. Given a binary tree with an integer data element; find all paths whose sum of data nodes will be equal to a given value

  7. Check if a binary tree (T2) is a sub tree of another tree (T1)

    • T1 has millions of nodes and T2 has hundreds of nodes

  8.  Find the inorder successor (next node) of a given node in a Binary Search Tree (BST)?

    • Each node has a link to its parent

  9. Find the first common ancestor of two nodes in a binary tree

    • Avoid storing additional nodes in any data structure

    • The binary tree might not be a Binary Search Tree (BST)

  10. Traverse the tree in spiral (zig zag) form and print nodes.

    • Consider below tree levels:

      • 1

      • 2 3

      • 4 5 6 7

      • 8 9

    • Result should be: 1 3 2 4 5 6 7 9 8

 

    Graphs

    1. Find out if there is a route between two nodes in a directed graph.

     

    Important Note!

    • I will add more to the list whenever I come across a new one.

    • If you were asked a problem not listed here, please let us know and we will add it here. You will also receive points. If you can provide a good solution and explanation also for your problem, you will get extra points and even cash prizes. 

    Search the Web

    Custom Search

    Searches whole web. Use the search in the right sidebar to search only within javajee.com!!!

    Quick Notes Finder Tags

    Activities (1) advanced java (1) agile (3) App Servers (6) archived notes (2) ArrayLists (1) Arrays (2) Best Practices (12) Best Practices (Design) (3) Best Practices (Java) (7) Best Practices (Java EE) (1) BigData (3) Chars & Encodings (6) coding problems (2) Collections (15) contests (3) Core Java (All) (52) course plan (2) Database (12) Design patterns (8) dev tools (3) downloads (2) eclipse (9) Essentials (1) examples (14) Exception (1) Exceptions (4) Exercise (1) exercises (6) Getting Started (18) Groovy (2) hadoop (4) hibernate (77) hibernate interview questions (6) History (1) Hot book (4) http monitoring (2) Inheritance (4) intellij (1) java 8 notes (4) Java 9 (1) Java Concepts (7) Java Core (7) java ee exercises (1) java ee interview questions (2) Java Elements (16) Java Environment (1) Java Features (4) java interview points (4) java interview questions (4) javajee initiatives (1) javajee thoughts (3) Java Performance (6) Java Programmer 1 (11) Java Programmer 2 (8) Javascript Frameworks (1) Java SE Professional (1) JSP (1) Legacy Java (1) linked list (3) maven (1) Multithreading (16) NFR (1) No SQL (1) Object Oriented (9) OCPJP (4) OCPWCD (1) OOAD (3) Operators (4) Overloading (2) Overriding (2) Overviews (1) policies (1) programming (1) Quizzes (17) references (2) resources (1) restful web service (3) Searching (1) security (10) Servlets (8) Servlets and JSP (31) Sorting (1) source code management (1) spring (4) spring boot (1) Spring Examples (1) Spring Features (1) spring jpa (1) Stack (1) Streams & IO (3) Strings (11) SW Developer Tools (2) testing (1) troubleshooting (1) user interface (1) vxml (8) web services (1) Web Technologies (1) Web Technology Books (1) youtube (1)