All categories
OJ (2,437)
- Two Sum (40)
- Add Two Numbers (16)
- Longest Substring Without Repeating Characters (16)
- Median of Two Sorted Arrays (24)
- Longest Palindromic Substring (18)
- ZigZag Conversion (22)
- Reverse Integer (14)
- String to Integer (atoi) (19)
- Palindrome Number (30)
- Regular Expression Matching (25)
- Container With Most Water (3)
- Integer to Roman (7)
- Roman to Integer (3)
- Longest Common Prefix (9)
- 3Sum (27)
- 3Sum Closest (5)
- Letter Combinations of a Phone Number (13)
- 4Sum (13)
- Remove Nth Node From End of List (2)
- Valid Parentheses (4)
- Merge Two Sorted Lists (14)
- Generate Parentheses (16)
- Merge k Sorted Lists (11)
- Swap Nodes in Pairs (11)
- Reverse Nodes in k-Group (6)
- Remove Duplicates from Sorted Array (25)
- Remove Element (11)
- Implement strStr() (14)
- Divide Two Integers (16)
- Substring with Concatenation of All Words (16)
- Next Permutation (8)
- Longest Valid Parentheses (20)
- Search in Rotated Sorted Array (9)
- Search for a Range (5)
- Search Insert Position (8)
- Valid Sudoku (12)
- Sudoku Solver (15)
- Count and Say (17)
- Combination Sum (20)
- Combination Sum II (7)
- First Missing Positive (9)
- Trapping Rain Water (10)
- Multiply Strings (10)
- Wildcard Matching (14)
- Jump Game II (8)
- Permutations (17)
- Permutations II (15)
- Rotate Image (4)
- Anagrams (14)
- Pow(x, n) (20)
- N-Queens (9)
- N-Queens II (7)
- Maximum Subarray (10)
- Spiral Matrix (10)
- Jump Game (23)
- Merge Intervals (19)
- Insert Interval (9)
- Length of Last Word (6)
- Spiral Matrix II (5)
- Permutation Sequence (7)
- Rotate List (17)
- Unique Paths (7)
- Unique Paths II (13)
- Minimum Path Sum (7)
- Valid Number (28)
- Plus One (11)
- Add Binary (5)
- Text Justification (15)
- Sqrt(x) (16)
- Climbing Stairs (15)
- Simplify Path (5)
- Edit Distance (10)
- Set Matrix Zeroes (11)
- Search a 2D Matrix (9)
- Sort Colors (11)
- Minimum Window Substring (17)
- Combinations (12)
- Subsets (8)
- Word Search (23)
- Remove Duplicates from Sorted Array II (10)
- Search in Rotated Sorted Array II (6)
- Remove Duplicates from Sorted List II (4)
- Remove Duplicates from Sorted List (12)
- Largest Rectangle in Histogram (8)
- Maximal Rectangle (6)
- Partition List (10)
- Scramble String (9)
- Merge Sorted Array (22)
- Gray Code (11)
- Subsets II (4)
- Decode Ways (12)
- Reverse Linked List II (12)
- Restore IP Addresses (6)
- Binary Tree Inorder Traversal (11)
- Unique Binary Search Trees II (12)
- Unique Binary Search Trees (6)
- Interleaving String (13)
- Validate Binary Search Tree (13)
- Recover Binary Search Tree (15)
- Same Tree (8)
- Symmetric Tree (16)
- Binary Tree Level Order Traversal (10)
- Binary Tree Zigzag Level Order Traversal (6)
- Maximum Depth of Binary Tree (20)
- Construct Binary Tree from Preorder and Inorder Traversal (12)
- Construct Binary Tree from Inorder and Postorder Traversal (10)
- Binary Tree Level Order Traversal II (8)
- Convert Sorted Array to Binary Search Tree (15)
- Convert Sorted List to Binary Search Tree (11)
- Balanced Binary Tree (12)
- Minimum Depth of Binary Tree (11)
- Path Sum (13)
- Path Sum II (13)
- Flatten Binary Tree to Linked List (14)
- Distinct Subsequences (6)
- Populating Next Right Pointers in Each Node (22)
- Populating Next Right Pointers in Each Node II (15)
- Pascal's Triangle (7)
- Pascal's Triangle II (13)
- Triangle (21)
- Best Time to Buy and Sell Stock (14)
- Best Time to Buy and Sell Stock II (17)
- Best Time to Buy and Sell Stock III (15)
- Binary Tree Maximum Path Sum (20)
- Valid Palindrome (14)
- Word Ladder II (30)
- Word Ladder (32)
- Longest Consecutive Sequence (21)
- Sum Root to Leaf Numbers (9)
- Surrounded Regions (39)
- Palindrome Partitioning (14)
- Palindrome Partitioning II (23)
- Clone Graph (34)
- Gas Station (20)
- Candy (34)
- Single Number (31)
- Single Number II (14)
- Copy List with Random Pointer (30)
- Word Break (27)
- Word Break II (34)
- Linked List Cycle (18)
- Linked List Cycle II (28)
- Reorder List (24)
- Binary Tree Preorder Traversal (23)
- Binary Tree Postorder Traversal (29)
- LRU Cache (52)
- Insertion Sort List (41)
- Sort List (54)
- Max Points on a Line (62)
- Evaluate Reverse Polish Notation (56)
- Reverse Words in a String (75)

Getting runtime error - surprising

167 views

Can Any one tell why am I getting runtime error for this simple code. It runs perfectly in my local compiler.

class Solution {
public:
    TreeNode *buildTree(vector<int> &preorder, vector<int> &inorder) {

    TreeNode *root;

    return root;
    }
};

closed with the note: Questions about code you've written must describe the specific problem clearly. Please read the FAQ (http://oj.leetcode.com/discuss/faq) for more info.

asked Feb 28 in Construct Binary Tree from Preorder and Inorder Traversal by vivek3 (230 points)
closed Mar 1 by 1337c0d3r

You code returns an uninitialized pointer, while the system tries to evaluate whether it is a correct tree or not, it will throw a runtime error if it tries to access its left or right child.

commented Mar 19 by xinglin (100 points)

...

Getting runtime error - surprising

Please log in or register to add a comment.