find left sibling in tree leetcode code example

Example: binary tree with sibling pointer in leetcode

struct Node {
  int val;
  Node *left;
  Node *right;
  Node *next;
}